Fundamental data movement operations and its applications on a hyper-bus broadcast network

A hyper-bus broadcast network (HBBN) consists of processors only sharing by some global buses, and there are no local links between processors. Based on such an architecture, we will exploit several ecient time parallel algorithms for solving the well-known fundamental data movement problems which had been extensively studied by researchers and widely applied to the ®eld of image processing, digitized geometry and computer graphics. These include the leftmost one problem, the pre®x maxima/minima problem, the m-contour problem, the all nearest neighbor problem and the all nearest smaller values problem, respectively. Note that the proposed algorithms not only can be implemented on the HBBN but also can be easily modi®ed to run on other broadcast-based networks with the same time and processor complexities. Ó 1999 Elsevier Science B.V. All rights reserved.